SQUARE –FULL NUMBERS IN THE SQUARE NETWORK
نویسندگان
چکیده
منابع مشابه
On Square-Free Numbers
In the article the formal characterization of square-free numbers is shown; in this manner the paper is the continuation of [19]. Essentially, we prepared some lemmas for convenient work with numbers (including the proof that the sequence of prime reciprocals diverges [1]) according to [18] which were absent in the Mizar Mathematical Library. Some of them were expressed in terms of clusters’ re...
متن کاملCounting Square-Free Numbers
The main topic of this contribution is the problem of counting square-free numbers not exceeding n. Before this work we were able to do it in time Õ( √ n). Here, the algorithm with time complexity Õ(n) and with memory complexity Õ(n) is presented. Additionally, a parallel version is shown, which achieves full scalability. As of now the highest computed value was for n = 10. Using our implementa...
متن کاملOn the Square Roots of Triangular Numbers
1. BALANCING NUMBERS We call an Integer n e Z a balancing number if 1+ 2+ --+ (»l ) = (w + l) + (w + 2) +••• + (» + >•) (1) for some r e Z. Here r is called the balancer corresponding to the balancing number n. For example, 6, 35, and 204 are balancing numbers with balancers 2, 14, and 84, respectively. It follows from (1) that, if n is a balancing number with balancer r, then n2^(n + r)(n + r ...
متن کاملSquare-bounded partitions and Catalan numbers
For each integer k ≥ 1, we define an algorithm which associates to a partition whose maximal value is at most k a certain subset of all partitions. In the case when we begin with a partition λ which is square-bounded, i.e. λ= (λ1 ≥ · · · ≥ λk) with λ1 = k and λk = 1, applying the algorithm times gives rise to a set whose cardinality is either the Catalan number c −k+1 (the self dual case) or tw...
متن کاملFull Square Rhomboids and Their Algebraic Expressions
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a full square rhomboid that is an example of non-series-parallel graphs. Our intention is to simplify the expressions of full square rhomboids and eventually find their shortest representations. With that end in view, we describe two decomposition methods for generating expressions of full...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Metodički obzori/Methodological Horizons
سال: 2010
ISSN: 1848-8455,1846-1484
DOI: 10.32728/mo.05.2.2010.07